Better Bounds for Graph Bisection
نویسندگان
چکیده
We introduce new lower bounds for the minimum graph bisection problem. Within a branch-and-bound framework, they enable the solution of a wide variety of instances with tens of thousands of vertices to optimality. Our algorithm compares favorably with the best previous approaches, solving long-standing open instances in minutes.
منابع مشابه
New Spectral Lower Bounds on the Bisection Width of Graphs
The communication overhead is a major bottleneck for the execution of a process graph on a parallel computer system. In the case of two processors, the minimization of the communication can be modeled by the graph bisection problem. The spectral lower bound of 2jV j 4 for the bisection width of a graph is well-known. The bisection width is equal to 2jV j 4 iff all vertices are incident to 2 2 c...
متن کاملA Local Graph Partitioning Heuristic Meeting Bisection Bounds
The problem of graph partitioning is of major importance for a broad range of applications. VLSI-Layout and parallel programming are only two examples where large graphs have to be cut into pieces. The partitioning of a graph into several clusters is often done by recursive bisection. Bisection heuristics are usually divided into global and local methods. Popular global methods are inertial or ...
متن کاملThe Bisection of Random Graphs: Rigorous Bounds Using the Analysis of Algorithms
Given a random graph G = G n;1=2 , we give almost sure bounds for the value of the minimum bisection of G. The lower bound is obtained by applying the rst moment method, while the upper bound is given by the analysis of a simple algorithm. Moreover, these results enable us to derive upper bounds for the maximum bisection and the maxcut of G.
متن کاملMulticommodity Flow Approximation Used for Exact Graph Partitioning
We present a fully polynomial-time approximation scheme for a multicommodity flow problem that yields lower bounds of the graph bisection problem. We compare the approximation algorithm with Lagrangian relaxation based cost-decomposition approaches and linear programming software when embedded in an exact branch&bound approach for graph bisection. It is shown that the approximation algorithm is...
متن کاملBisecting de Bruijn and Kautz Graphs
De Bruijn and Kautz graphs have been intensively studied as perspective interconnection networks of massively parallel computers. One of the crucial parameters of an interconnection network is its bisection width. It has innuence on both communication properties of the network and the algorithmic design. We prove optimal bounds on the edge and vertex bisection widths of the k-ary n-dimensional ...
متن کامل